A Python Library for FCA with Conjunctive Queries
نویسنده
چکیده
The paper presents a Python library for building concept lattices over power context families, using intension graphs (which formalize conjunctive queries) as concept intents. The IntensionGraph class implements intension graphs and algebraic operations on them. An interactive Jupyter notebook session is illustrated and used to present core API features. Intension graphs, power context families and morphism tables have visualizations as SVG or HTML provided by the library and supported by the notebook.
منابع مشابه
Publish/Subscribe with RDF Data over Large Structured Overlay Networks
We study the problem of evaluating RDF queries over structured overlay networks. We consider the publish/subscribe scenario where nodes subscribe with long-standing queries and receive notifications whenever triples matching their queries are inserted in the network. In this paper we focus on conjunctive multi-predicate queries. We demonstrate that these queries are useful in various modern app...
متن کاملComputing Intensions of Digital Library Collections
We model a Digital Library as a formal context in which objects are documents and attributes are terms describing documents contents. A formal concept is very close to the notion of a collection: the concept extent is the extension of the collection; the concept intent consists of a set of terms, the collection intension. The collection intension can be viewed as a simple conjunctive query whic...
متن کاملConcept Lattices of RDF Graphs
The concept lattice of an RDF graph is defined. The intents are described by graph patterns rather than sets of attributes, a view that is supported by the fact that RDF data is essentially a graph. A simple formalization by triple graphs defines pattern closures as connected components of graph products. The patterns correspond to conjunctive queries, generalization of properties is supported....
متن کاملOn the First-Order Reducibility of Unions of Conjunctive Queries over Inconsistent Databases
Recent approaches in the research on inconsistent databases have started analyzing the first-order reducibility of consistent query answering, i.e., the possibility of identifying classes of queries whose consistent answers can be obtained by a first-order (FOL) rewriting of the query, which in turn can be easily formulated in SQL and directly evaluated through any relational DBMS. So far, the ...
متن کاملContainment and Optimization of Object-Preserving Conjunctive Queries
In the optimization of queries in an object-oriented database system (OODB), a natural rst step is to use the typing constraints imposed by the schema to transform a query into an equivalent one that logically accesses a minimal set of objects. We study a class of queries for OODB's called conjunctive queries. Variables in a conjunctive query range over heterogeneous sets of objects. Consequent...
متن کامل